A reduction algorithm for integer multiple objective linear programs
نویسندگان
چکیده
منابع مشابه
A Scalable Parallel Algorithm for Multiple Objective Linear Programs
This paper presents an ADBASE-based parallel algorithm for solving multiple objective linear programs (MOLPs). Job balance, speedup and scalability are of primary interest in evaluating e ciency of the new algorithm. Implementation results on Intel iPSC/2 and Paragon multiprocessors show that the algorithm signi cantly speeds up the process of solving MOLPs, which is understood as generating al...
متن کاملA Branch-and-cut Algorithm for Integer Bilevel Linear Programs
We describe a rudimentary branch-and-cut algorithm for solving integer bilevel linear programs that extends existing techniques for standard integer linear programs to this very challenging computational setting. The algorithm improves on the branch-and-bound algorithm of Moore and Bard in that it uses cutting plane techniques to produce improved bounds, does not require specialized branching s...
متن کاملA bookkeeping strategy for multiple objective linear programs
This paper discusses the bookkeeping strategies for solving large multiple objective linear programs (MOLPs) on ADBASE, a well developed sequential software package, and on a parallel ADBASE algorithm. Three representative list creation schemes were rst analyzed and tested. The best of them, Binary Search with Insertion Sort (BSIS), was selected to be incorporated into ADBASE and the parallel A...
متن کاملFuzzy reasoning for solving fuzzy multiple objective linear programs
We interpret fuzzy multiple objective linear programming (FMOLP) problems with fuzzy coefficients and fuzzy inequality relations as multiple fuzzy reasoning schemes (MFR), where the antecedents of the scheme correspond to the constraints of the FMOLP problem and the facts of the scheme are the objectives of the FMOLP problem. Then the solution process consists of two steps: first, for every dec...
متن کاملA Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs
We consider discrete bilevel optimization problems where the follower solves an integer program with a fixed number of variables. Using recent results in parametric integer programming, we present polynomial time algorithms for pure and mixed integer bilevel problems. For the mixed integer case where the leader’s variables are continuous, our algorithm also detects whether the infimum cost fail...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 1997
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(96)00407-9